Design of a Stochastic Traffic Regulator for End-to-End Network Delay Guarantees
نویسندگان
چکیده
Providing end-to-end network delay guarantees in packet-switched networks such as the Internet is highly desirable for mission-critical and delay-sensitive data transmission, yet it remains a challenging open problem. Since deterministic bounds are based on worst-case traffic behavior, various frameworks stochastic calculus have been proposed to provide less conservative, probabilistic delay, at least theory. However, little attention has devoted problem of regulating according burstiness bounds, which necessary order guarantee practice. We design analyze regulator that can be used conjunction with results from delay. Two alternative implementations developed compared. Numerical provided demonstrate performance regulator.
منابع مشابه
Traffic Shaping for End-to-End Delay Guarantees with EDF Scheduling
Abstract— The provision of Quality of Service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Of the various packet scheduling schemes that have been proposed in the literature, Earliest Deadline First (EDF) scheduling in conjunction with per-hop traffic shaping (jointly referred to as Rate-Controlled EDF or RC...
متن کاملEnd-to-End Delay Guarantees for Multiple-Channel Schedulers
Consider a network in which adjacent nodes exchange messages via multiple communication channels. Multiple channels between adjacent nodes are desirable due to their cost effectiveness and improved fault-tolerance. We consider the problem of providing deterministic quality of service guarantees in this network. We show that any scheduling protocol designed for a single channel can be converted ...
متن کاملOn Routing Algorithms with End-to-End Delay Guarantees
We consider the transmission of a message of size r from a source to a destination over a computer network with n nodes and m links. There are three sources of delays: (a) propagation delays along the links, (b) delays due to bandwidth availability on the links, and (c) queuing delays at the intermediate nodes. First, we consider that the delays on various links and nodes are given as functions...
متن کاملOptimal routing for end-to-end guarantees using Network Calculus
In this paper we show how Network Calculus can be used to compute the optimal route for a flow (w.r.t. end-to-end guarantees on the delay or the backlog) in a network in the presence of cross-traffic. When cross-traffic is independent, the computation is shown to boild down to a functional shortest path problem. When cross-traffic perturbates the main flow over more than one node, then the “Pay...
متن کاملMaximum End-to-End Delay of QTNPOSS Network for Multimedia Traffic
To improve the Quality of Service (QoS) ability of TNPOSS (To Next-hop Port Sequence Switch) network, this paper proposes a QoS-enhanced TNPOSS (QTNPOSS) network model by introducing Fractal Leak Bucket (FLB) shaper and Weighted Fair Queuing (WFQ) scheduler. In the proposed model, packets of multimedia traffic are shaped by the FLB shaper and scheduled by the WFQ scheduler. Moreover, the servic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE ACM Transactions on Networking
سال: 2022
ISSN: ['1063-6692', '1558-2566']
DOI: https://doi.org/10.1109/tnet.2022.3181858